نتایج جستجو برای: ICDE algorithm

تعداد نتایج: 754072  

2009
Millie Pant Radha Thangaraj V. P. Singh

Differential Evolution (DE) is a novel evolutionary approach capable of handling nondifferentiable, non-linear and multi-modal objective functions. DE has been consistently ranked as one of the best search algorithm for solving global optimization problems in several case studies. This paper presents an Improved Constraint Differential Evolution (ICDE) algorithm for solving constrained optimiza...

In this study, weight optimization of the prismatic core sandwich panel under transverse and longitudinal loadings has been independently investigated. To solve the optimization problems corresponding to the mentioned loadings, a new Improved Constrained Differential Evolution (ICDE) algorithm based on the multi-objective constraint handling method is implemented. The constraints of the problem...

2015
G. Balaji R. Balamurugan

In this paper, Generator Maintenance Scheduling (GMS) in a vertically integrated power system is considered. The objective of the GMS problem is to find the particular time interval for maintenance of power generating units with an intention of maximizing the security of the power system. In this paper, scheduling of generating units for planned preventive maintenance is formulated as a mixed i...

Journal: :IEEE Data Eng. Bull. 2007
Calton Pu

Steering Committee(StC) to communicate directly with TCDE members. Second, I want to thank members of the StC for electing me as the new chair. I will do my best to carry out the duties of the StC chair. The main purpose of this letter is to explain the function of ICDE StC. Foremost is an acknowledgement and expression of gratitude to the past StC chair, Dr. Erich Neuhold. During the last 8 ye...

2015
Liming Zhu

One problem lurking at the back of the ICDE development team’s mind is related to capacity planning for new ICDE installations. When an ICDE installation supports multiple users, the request load will become high, and the hardware that the platform runs on needs to be powerful enough to support this request load. If the hardware becomes saturated, it will not be able to process all user generat...

2016
Mei Hsu Alfons Kemper Timos K. Sellis Boris Novikov Eljas Soisalon-Soininen

Since its inception in 1984, the IEEE International Conference on Data Engineering (ICDE) has become a premier forum for the exchange and dissemination of data management research results among researchers, users, practitioners, and developers. Continuing this long-standing tradition, the 32nd ICDE will be hosted this year in Helsinki, Finland, from May 16 to May 20, 2016. It is our great pleas...

Journal: :Expert Syst. Appl. 2015
V. Ho-Huu Trung Nguyen-Thoi M. H. Nguyen-Thoi L. Le-Anh

Recently, an improved (l + k) constrainted differential evolution (ICDE) has been proposed and proven to be robust and effective for solving constrainted optimization problems. However, so far, the ICDE has been developed mainly for continuous design variables, and hence it becomes inappropriate for solving layout truss optimization problems which contain both discrete and continuous variables....

2012
Serge Abiteboul Christoph Koch Kian-Lee Tan Jian Pei

THE 27th International Conference on Data Engineering (ICDE 2011) was held in Hannover, Germany, on 11-16 April. ICDE 2011 received 491 research manuscripts, 26 industrial contributions, and 67 demo proposals, for a total of over 584 submissions. The research program featured 98 papers, the industrial program included eight submitted papers, and 21 demonstration proposals were selected for pres...

Journal: :IEEE Data Eng. Bull. 2012
Kyu-Young Whang

is mostly in database systems including query processing/optimization, physical database design, indexing, and more recently, in DB-IR integration and search engines. He is an author of over 120 papers in major journals and conferences. He served the research community in various capacities including the coordinating Editor-in-Chief of The VLDB Journal, the general chair of VLDB2006, a PC co-ch...

2017

We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large document tree, e.g., DBLP with 26M nodes, using the canonical tree edit distance as a similarity measure between subtrees. Evaluating the tree edit distance for large XML trees is difficult: the best known algorithms have cubic runti...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید